720 research outputs found
Design of an electrical floor heating panel manufactured by transfer foil technology
Abstract. In this thesis, a heater-integrated floor material and its possibilities in the field of floor heating were examined. The heater was designed to be manufactured by transfer foil technology. LTSpice and COMSOL simulation tools were utilized to model power losses and heating power, and three different heater versions were designed with Altium designer, and their simulation results and other properties of the heaters were compared. The main goal of the work was to find out the possibility of making floor heating for large surface areas from these heating panels and it was found that it would be possible to make over 100m² surfaces with under 1 ºC tolerance for the desired heating temperature.Siirtokalvotekniikalla valmistettavan sähköisen lattialämmityspaneelin suunnittelu. Tiivistelmä. Tässä työssä tarkasteltiin siirtokalvotekniikalla valmistettavan lämmitysvastuksen integroimista lattiamateriaaliin ja sen mahdollisuuksia lattialämmityksen saralla. Työssä hyödynnettiin LTSpice- ja COMSOL-simulointityökaluja lämmitystehon ja tehohäviöiden mallinnukseen ja piirrettiin Altiumilla kolme eri lämmitinversiota ja vertailtiin niiden simulointituloksia sekä lämmittimien muita ominaisuuksia. Työn tärkeimpänä tavoitteena oli selvittää mahdollisuutta tehdä lämmityspaneeleista lattialämmitys suurille lattiapinta-aloille. Saatiin selville, että näillä lämmityspaneeleilla olisi mahdollista tehdä yli 100m² lattiapintoja alle yhden asteen toleranssilla halutulle lämpötilalle
Fast Label Extraction in the CDAWG
The compact directed acyclic word graph (CDAWG) of a string of length
takes space proportional just to the number of right extensions of the
maximal repeats of , and it is thus an appealing index for highly repetitive
datasets, like collections of genomes from similar species, in which grows
significantly more slowly than . We reduce from to
the time needed to count the number of occurrences of a pattern of
length , using an existing data structure that takes an amount of space
proportional to the size of the CDAWG. This implies a reduction from
to in the time needed to
locate all the occurrences of the pattern. We also reduce from
to the time needed to read the characters of the
label of an edge of the suffix tree of , and we reduce from
to the time needed to compute the matching
statistics between a query of length and , using an existing
representation of the suffix tree based on the CDAWG. All such improvements
derive from extracting the label of a vertex or of an arc of the CDAWG using a
straight-line program induced by the reversed CDAWG.Comment: 16 pages, 1 figure. In proceedings of the 24th International
Symposium on String Processing and Information Retrieval (SPIRE 2017). arXiv
admin note: text overlap with arXiv:1705.0864
Composite repetition-aware data structures
In highly repetitive strings, like collections of genomes from the same
species, distinct measures of repetition all grow sublinearly in the length of
the text, and indexes targeted to such strings typically depend only on one of
these measures. We describe two data structures whose size depends on multiple
measures of repetition at once, and that provide competitive tradeoffs between
the time for counting and reporting all the exact occurrences of a pattern, and
the space taken by the structure. The key component of our constructions is the
run-length encoded BWT (RLBWT), which takes space proportional to the number of
BWT runs: rather than augmenting RLBWT with suffix array samples, we combine it
with data structures from LZ77 indexes, which take space proportional to the
number of LZ77 factors, and with the compact directed acyclic word graph
(CDAWG), which takes space proportional to the number of extensions of maximal
repeats. The combination of CDAWG and RLBWT enables also a new representation
of the suffix tree, whose size depends again on the number of extensions of
maximal repeats, and that is powerful enough to support matching statistics and
constant-space traversal.Comment: (the name of the third co-author was inadvertently omitted from
previous version
Suffix Tree of Alignment: An Efficient Index for Similar Data
We consider an index data structure for similar strings. The generalized
suffix tree can be a solution for this. The generalized suffix tree of two
strings and is a compacted trie representing all suffixes in and
. It has leaves and can be constructed in time.
However, if the two strings are similar, the generalized suffix tree is not
efficient because it does not exploit the similarity which is usually
represented as an alignment of and .
In this paper we propose a space/time-efficient suffix tree of alignment
which wisely exploits the similarity in an alignment. Our suffix tree for an
alignment of and has leaves where is the sum of
the lengths of all parts of different from and is the sum of the
lengths of some common parts of and . We did not compromise the pattern
search to reduce the space. Our suffix tree can be searched for a pattern
in time where is the number of occurrences of in and
. We also present an efficient algorithm to construct the suffix tree of
alignment. When the suffix tree is constructed from scratch, the algorithm
requires time where is the sum of the lengths
of other common substrings of and . When the suffix tree of is
already given, it requires time.Comment: 12 page
Document Retrieval on Repetitive Collections
Document retrieval aims at finding the most important documents where a
pattern appears in a collection of strings. Traditional pattern-matching
techniques yield brute-force document retrieval solutions, which has motivated
the research on tailored indexes that offer near-optimal performance. However,
an experimental study establishing which alternatives are actually better than
brute force, and which perform best depending on the collection
characteristics, has not been carried out. In this paper we address this
shortcoming by exploring the relationship between the nature of the underlying
collection and the performance of current methods. Via extensive experiments we
show that established solutions are often beaten in practice by brute-force
alternatives. We also design new methods that offer superior time/space
trade-offs, particularly on repetitive collections.Comment: Accepted to ESA 2014. Implementation and experiments at
http://www.cs.helsinki.fi/group/suds/rlcsa
A Faster Implementation of Online Run-Length Burrows-Wheeler Transform
Run-length encoding Burrows-Wheeler Transformed strings, resulting in
Run-Length BWT (RLBWT), is a powerful tool for processing highly repetitive
strings. We propose a new algorithm for online RLBWT working in run-compressed
space, which runs in time and bits of space, where
is the length of input string received so far and is the number of runs
in the BWT of the reversed . We improve the state-of-the-art algorithm for
online RLBWT in terms of empirical construction time. Adopting the dynamic list
for maintaining a total order, we can replace rank queries in a dynamic wavelet
tree on a run-length compressed string by the direct comparison of labels in a
dynamic list. The empirical result for various benchmarks show the efficiency
of our algorithm, especially for highly repetitive strings.Comment: In Proc. IWOCA201
The effects of interprofessional education - Self-reported professional competence among prehospital emergency care nursing students on the point of graduation - A cross-sectional study
The aim of the study was to investigate whether interprofessional education (IPE) and interprofessional collaboration (IPC) during the educational program had an impact on prehospital emergency care nurses' (PECN) self-reported competence towards the end of the study program. A cross-sectional study using the Nurse Professional Competence (NPC) Scale was conducted. A comparison was made between PECN students from Finland who experienced IPE and IPC in the clinical setting, and PECN students from Sweden with no IPE and a low level of IPC. Forty-one students participated (Finnish n = 19, Swedish n = 22). The self-reported competence was higher among the Swedish students. A statistically significant difference was found in one competence area; legislation in nursing and safety planning (p <0.01). The Finnish students scored significantly higher on items related to interprofessional teamwork. Both the Swedish and Finnish students' self-reported professional competence was relatively low according to the NPC Scale. Increasing IPC and IPE in combination with offering a higher academic degree may be an option when developing the ambulance service and the study program for PECNs. (C) 2017 Elsevier Ltd. All rights reserved.Peer reviewe
- …